Specifying Component Behavior with Port State Machines
نویسنده
چکیده
Protocol State Machines (PSM) in UML 2.0 [13] describe valid sequences of operation calls. To support modeling components, UML 2.0 introduces a Port associated with a set of provided and required interfaces. Unfortunately, a PSM is applicable only to a single interface, either a provided or required one; moreover, nested calls cannot be modeled with a PSM. Furthermore, the definition of protocol conformance is rather fuzzy and reasoning on this relation is not possible in general; thus reasoning on consistency in component composition is not possible with PSMs. Behavior Protocols [17] capture the behavior of a component via a set of traces. A textual notation similar to regular expressions is provided to approximate the behavior with a regular language. In [1,17], the compliance relation and consent operator are defined to reason on consistency of component composition; a verifier tool [18] is available for the compliance relation. In this paper, we propose the Port State Machine (PoSM) to model the communication on a Port. Building on our experience with behavior protocols, we model an operation call as two atomic events request and response, permitting PoSM to capture the interleaving and nesting of operation calls on provided and required interfaces of the Port. The trace semantics of PoSM yields a regular language. We apply the compliance relation of behavior protocols to PoSMs, allowing us to reason on behavior compliance of components in software architectures; the existing verifier tool can be applied to PoSMs.
منابع مشابه
Enhancing Component Behavior Specifications with Port State Machines
Protocol State Machines (PSM) in UML 2.0 [13] describe valid sequences of operation calls. To support modeling components, UML 2.0 introduces structured classifiers, featuring Ports associated with provided and required interfaces. Unfortunately, PSMs are applicable only to a single interface, either a provided or required one; moreover, nested calls cannot be modeled with a PSM. Furthermore, t...
متن کاملSpecifying Transaction Control to Serialize Concurrent Program Executions
We define a programming language independent transaction controller and an operator which when applied to concurrent programs with shared locations turns their behavior with respect to some abstract termination criterion into a transactional behavior. We prove the correctness property that concurrent runs under the transaction controller are serialisable. We specify the transaction controller T...
متن کاملSpecifying Formal executable Behavioral Models for Structural Models of Service-oriented Components
This paper presents a behavioral formalism based on the Abstract State Machine (ASM) formal method and intended for high-level, platform-independent, executable specification of Service-oriented Components. We complement the recent Service Component Architecture – a graphical notation able to provide the overall and the components structure – with an ASM-based formalism able to describe the wor...
متن کاملA Prototyping Environment for Specifying, Executing and Checking Communicating Real-Time State Machines
We describe a toolset, consisting of a graphical editor, a simulator, and an assertion checker, for prototyping real-time systems that are specified as Communicating Real-Time State machines (CRSMs). CRSMs are timed state machines that communicate synchronously over unidirectional channels. The system behavior of CRSMs is characterized by a time-stamped trace of communication events. Safety and...
متن کاملStatecharts For Requirements Specification – As Simple As Possible , As Rich As Needed
Statecharts have evolved into a widely used instrument for specifying system behavior and interaction. Several variants of statecharts have been developed, for example, Harel's original statecharts, UML state machines or derived concepts such as the state machines in RSML. In this paper I investigate how a statechart variant for requirements models should look if we want it to be as simple as p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 101 شماره
صفحات -
تاریخ انتشار 2004